Randomized Parallel Proof-Number Search
نویسندگان
چکیده
Proof-Number Search (PNS) is a powerful method for solving games and game positions. Over the years, the research on PNS has steadily produced new insights and techniques. With multi-core processors becoming established in the recent past, the question of parallelizing PNS has gained new urgency. This article presents a new technique called Randomized Parallel Proof-Number Search (RP–PNS) for parallelizing PNS on multi-core systems with shared memory. The parallelization is based on randomizing the move selection of multiple threads, which operate on the same search tree. RP–PNS is tested on a set of complex Linesof-Action endgame positions. Experiments show that RP–PNS scales well. Four directions for future research are given.
منابع مشابه
Parallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simple but effective parallelization of the df-pn search algorithm for a shared-memory system. In this parallelization, multiple agents autonomously conduct the df-pn with a shared transposition table. For effective coopera...
متن کاملRandomized Parallel Proof-Number Search1
Most computer programs for board games successfully employ αβ search. For some games, however, αβ search displays a weakness in the endgame that can currently neither be overcome by endgame databases nor by other αβ extensions. To remedy the deficit, mate searches may be applied. One such alternative to αβ search is Proof-Number Search (PNS). PNS enjoys popularity as a powerful method for solvi...
متن کاملAnalysis of Random Polling Dynamic Load Balancing
Dynamic load balancing is crucial for the performance of many parallel algorithms. Random Polling, a simple randomized algorithm, has proved to be very eecient in practice for applications like parallel depth rst search. This paper derives tight bounds for the scalability of Random Polling which are for the rst time able to explain its superior performance analytically. In some cases, Random Po...
متن کاملA detailed analysis of random polling dynamic load balancing
Dynamic load balancing is crucial for the performance of many parallel algorithms. Random Polling, a simple randomized load balancing algorithm, has proved to be very eecient in practice for applications like parallel depth rst search. This paper presents a detailed analysis of the algorithm taking into account many aspects of the underlying machine and the application to be load balanced. It d...
متن کاملScalable Parallel DFPN Search
We present Scalable Parallel Depth-First Proof Number Search, a new shared-memory parallel version of depth-first proof number search. Based on the serial DFPN 1+ε method of Pawlewicz and Lew, SPDFPN searches effectively even as the transposition table becomes almost full, and so can solve large problems. To assign jobs to threads, SPDFPN uses proof and disproof numbers and two parameters. SPDF...
متن کامل